The Delaunay tessellation in hyperbolic space
نویسندگان
چکیده
منابع مشابه
Seal Identification Using the Delaunay Tessellation
A new approach which differs from the conventional pattern recognition techniques in partitioning a seal imprint image into a triangular tessellation is proposed. The image plane is segmented into a mesh of triangles according to the Delaunay triangulation paradigm, and the distribution of the triangular area is used as the primary feature for matching unrecognized seal imprints with model imag...
متن کاملGeometric Properties of the Adaptive Delaunay Tessellation
Recently, the Adaptive Delaunay Tessellation (Adt) was introduced in the context of computational mechanics as a tool to support Voronoi-based nodal integration schemes in the finite element method. While focusing on applications in mechanical engineering, the former presentation lacked rigorous proofs for the claimed geometric properties of the Adt necessary for the computation of the nodal in...
متن کاملDelaunay Cells for Arrangements of Flats in Hyperbolic Space
For n + 1 disjoint flats of dimension k in H, we produce a Delaunay cell which is a generalization of the Delaunay simplex associated to n + 1 points in H. Combinatorially, these Delaunay cells resemble truncated n-dimensional simplices. For certain classes of arrangements of flats in H, we prove that these Delaunay cells can be glued together to form a Delaunay complex, with the result that al...
متن کاملTaxonomy of space tessellation
When we map an area or create a digital database for it, the first task is often to partition the space into smaller units. There are traditionally two methods of partitioning: vector and raster. A vector partition delineates the boundary of features by polylines while a raster partition subdivides the space into a regular matrix of square or rectangular pixels. These two are complementary meth...
متن کاملGPU-based computation of discrete periodic centroidal Voronoi tessellation in hyperbolic space
Periodic centroidal Voronoi tessellation (CVT) in hyperbolic space provides a nice theoretical framework for computing the constrained CVT on high-genus (genus > 1) surfaces. This paper addresses two computational issues related to such hyperbolic CVT framework: (1) efficient reduction of unnecessary site copies in neighbor domains on the universal covering space, based on two special rules; (2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 2016
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s0305004116000827